Subshifts and Logic: Back and Forth
نویسندگان
چکیده
We study the Monadic Second Order (MSO) Hierarchy over colourings of the discrete plane, and draw links between classes of formula and classes of subshifts. We give a characterization of existential MSO in terms of projections of tilings, and of universal sentences in terms of combinations of “pattern counting” subshifts. Conversely, we characterise logic fragments corresponding to various classes of subshifts (subshifts of finite type, sofic subshifts, all subshifts). Finally, we show by a separation result how the situation here is different from the case of tiling pictures studied earlier by Giammarresi et al.
منابع مشابه
Subshifts, Languages and Logic
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tilings. Conversely, we characterise logic fragments corresponding to various classes of infinite pictures (subshifts of finite type, sofic subshifts).
متن کاملLinear Temporal Logic and Propositional Schemata, Back and Forth (extended version)
This paper relates the well-known formalism of Linear Temporal Logic [Pnu77] with the logic of propositional schemata introduced in [ACP09]. We prove that LTL is equivalent to a particular class of schemata in the sense that polynomial-time translation algorithms exist from one logic to the other. Some consequences about complexity are given. We report about first experiments and the consequenc...
متن کاملOn Relating Causal Theories to Other Formalisms
This paper explores mathematical relationships between the \causal theories" formalism recently introduced by the authors and several other (well-known) formalisms. More specii-cally, it relates causal theories to default logic and autoepistemic logic, and describes translations back and forth between causal theories and classical propositional logic. It also relates action representations in c...
متن کاملBack and forth bisimulations
This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation leads to the same equivalence as the ordinary notion of strong bisimulation. Then it is shown that ...
متن کاملMeasuring complexities of classes of structures
How do we compare the complexities of various classes of structures? The Turing ordinal of a class of structures, introduced by Jockusch and Soare, is defined in terms of the number of jumps required for coding to be possible. The back-and-forth ordinal, introduced by Montalbán, is defined in terms of Σα-types. The back-and-forth ordinal is (roughly) bounded by the Turing ordinal. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0912.1272 شماره
صفحات -
تاریخ انتشار 2009